Back to course home
0% completed
Vote For New Content
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Tree Breadth First Search (BFS) Pattern (easy)
Introduction to Tree Breadth First Search Pattern
Sum of Nodes with Even-Valued Grandparent (medium)
Solution: Sum of Nodes with Even-Valued Grandparent
All Nodes Distance K in Binary Tree (medium)
Solution: All Nodes Distance K in Binary Tree
Level Order Successor (easy)
Solution: Level Order Successor
Connect Level Order Siblings (medium)
Solution: Connect Level Order Siblings
Connect All Level Order Siblings (medium)
Solution: Connect All Level Order Siblings
Tree Depth First Search (DFS) Pattern (medium)
Introduction to Tree Depth First Search Pattern
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Count Good Nodes in Binary Tree (medium)
Solution: Count Good Nodes in Binary Tree
Path Sum III (medium)
Solution: Path Sum III
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Maximum Difference Between Node and Ancestor (medium)
Solution: Maximum Difference Between Node and Ancestor
Root to Leaf Path Pattern (medium)
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Leaf Processing Pattern (medium)
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Tree View Pattern (medium)
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Comparison of Two Trees Pattern (medium)
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Maximum Level Sum of a Binary Tree (medium)
Problem Statement
You are given the root of a binary tree. The level of its root node is 1, the level of its children is 2, and so on.
Return the level x where the sum of the values of all nodes is the highest. If there are multiple levels with the same maximum sum, return the smallest level number x.
Examples
Example 1:
- Input: root =
[1, 20, 3, 4, 5, null, 8]
- Expected Output:
2 - Explanation:
Level 1 has nodes:[1]with sum =1
Level 2 has nodes:[20, 3]with sum =20 + 3 = 23
Level 3 has nodes:[4, 5, 8]with sum =4 + 5 + 8 = 17
The maximum sum is23at level2.
Example 2:
- Input: root =
[10, 5, -3, 3, 2, null, 11, 3, -2, null, 1]
- Expected Output:
3 - Explanation:
Level 1 has nodes:[10]with sum =10
Level 2 has nodes:[5, -3]with sum =5 - 3 = 2
Level 3 has nodes:[3, 2, 11]with sum =3 + 2 + 11 = 16
Level 4 has nodes:[3, -2, 1]with sum =3 - 2 + 1 = 2
The maximum sum is16at level3.
Example 3:
- Input: root =
[5, 6, 7, 8, null, null, 9, null, null, 10]
- Expected Output:
2 - Explanation:
Level 1 has nodes:[5]with sum =5
Level 2 has nodes:[6, 7]with sum =6 + 7 = 13
Level 3 has nodes:[8, 9]with sum =8 + 9 = 17
Level 4 has nodes:[10]with sum =10
The maximum sum is17at level3.
Constraints:
- The number of nodes in the tree is in the range [1, 104].
- -105 <= Node.val <= 105
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Maximum Width of Binary Tree
Solution: Maximum Level Sum of a Binary Tree
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself